0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.13 % Command : run_vampire %s %d 0.13/0.34 % Computer : n014.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 1200 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Jul 13 15:07:49 EDT 2021 0.13/0.34 % CPUTime : 0.13/0.34 This is a THF_ problem 0.13/0.35 Running vampire --ignore_missing on --mode casc_hol --cores 0 -t 120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.13/0.35 Running in auto input_syntax mode. Trying TPTP 0.13/0.40 % (6506)lrs+1011_8_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=100000:afq=1.1:er=filter:gsp=input_only:gs=on:gsem=on:lma=on:nm=6:nwc=1:stl=30:sd=2:ss=axioms:st=1.5:sos=on:thsq=on_3 on theBenchmark 0.21/0.41 % (6512)dis+1010_3:2_av=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:gsp=input_only:nm=2:nwc=1:sp=reverse_arity:urr=ec_only:thsq=on_29 on theBenchmark 0.21/0.41 % (6507)dis+10_128_acc=on:add=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on:thsq=on_2 on theBenchmark 0.21/0.41 % (6509)ott+1002_8:1_add=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afr=on:afp=100000:afq=1.1:amm=off:anc=none:bd=off:bs=unit_only:fsr=off:gs=on:gsem=off:nm=32:nwc=10:sp=occurrence:urr=on:updr=off:thsq=on_14 on theBenchmark 0.21/0.41 % (6510)lrs+1011_5:1_acc=on:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off:thsq=on_3 on theBenchmark 0.21/0.42 % (6508)lrs+1010_8_add=off:afp=100000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on:thsq=on_13 on theBenchmark 0.21/0.43 % (6504)ott+1002_2_av=off:bd=preordered:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:irw=on:lma=on:nm=64:nwc=10:sp=reverse_arity:updr=off:thsq=on_2 on theBenchmark 0.21/0.43 % (6530)lrs+1010_8_add=off:afp=100000:csup=on:inj=off:cases=on:chr=off:e2e=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on:thsq=on_13 on theBenchmark 0.21/0.43 % (6532)lrs-11_4:1_afp=4000:csup=on:inj=on:mXXn=1:cases=on:e2e=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on:thsq=on_186 on theBenchmark 0.21/0.43 % (6528)lrs+1002_1_add=large:csup=on:inj=on:fe=off:chr=on:cases=on:cnfonf=eager:afr=on:afp=1000:afq=1.1:amm=sco:anc=none:er=known:fsr=off:gs=on:gsem=off:lma=on:nm=2:newcnf=on:nwc=2:stl=30:sd=1:ss=axioms:st=5.0:sp=reverse_arity:updr=off:thsq=on_50 on theBenchmark 0.21/0.43 % (6533)dis+1002_4_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=40000:afq=1.0:anc=none:cond=fast:fde=none:gs=on:gsaa=full_model:lma=on:lwlo=on:nm=0:nwc=1.5:sp=reverse_arity:tha=off_300 on theBenchmark 0.21/0.43 % (6505)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on:thsq=on_2 on theBenchmark 0.21/0.44 % (6519)ott+2_2_afp=10000:afq=1.4:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:amm=off:anc=none:gsp=input_only:gs=on:gsem=off:irw=on:lcm=predicate:nm=32:nwc=1.5:sos=on:sp=reverse_arity:thsq=on_7 on theBenchmark 0.21/0.44 % (6521)lrs+1011_5:1_acc=on:csup=on:inj=on:e2e=on:prag=on:cases=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off:thsq=on_30 on theBenchmark 0.21/0.44 % (6523)dis+1002_3:1_acc=model:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afr=on:afp=40000:afq=1.1:anc=none:ccuc=first:fsr=off:gsp=input_only:irw=on:nm=16:nwc=1:sos=all:thsq=on_8 on theBenchmark 0.21/0.44 % (6524)lrs+10_12_add=off:afp=100000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.4:amm=sco:anc=none:cond=on:lma=on:nm=64:nwc=1.3:stl=30:sac=on:urr=on:thsq=on_41 on theBenchmark 0.21/0.45 % (6531)lrs+1_4_afp=100000:afq=1.2:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:anc=none:bd=off:cond=on:gs=on:gsem=off:nm=64:nwc=1:sd=2:ss=axioms:st=2.0:sos=all:updr=off:thsq=on_300 on theBenchmark 0.21/0.45 % (6525)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:cases=on:cnfonf=lazy_gen:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on:thsq=on_30 on theBenchmark 0.21/0.45 % (6516)dis+1002_6_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=40000:afq=2.0:bsr=on:cond=on:irw=on:lma=on:nm=2:nwc=2.5:nicw=on:sp=reverse_arity:updr=off:thsq=on_2 on theBenchmark 0.21/0.45 % (6511)lrs+4_3_av=off:br=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:nm=0:newcnf=on:nwc=1:stl=30:sp=occurrence:urr=on:thsq=on_32 on theBenchmark 0.21/0.45 % (6534)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:e2e=on:prag=on:cases=on:cnfonf=eager:afq=1.0:fde=all:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on:thsq=on_50 on theBenchmark 0.21/0.45 % (6515)dis-11_3_add=off:afp=40000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=sco:anc=none:gs=on:irw=on:lcm=reverse:nm=6:nwc=1:sd=4:ss=axioms:st=3.0:sos=on:sac=on:thsq=on_2 on theBenchmark 0.21/0.45 % (6517)lrs+1010_3_av=off:fsr=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:gs=on:gsem=off:nm=2:newcnf=on:nwc=2:stl=30:sp=reverse_arity:urr=on:updr=off:thsq=on_9 on theBenchmark 0.21/0.45 % (6518)lrs+1002_1_av=off:er=filter:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:fsr=off:gs=on:gsem=off:irw=on:lma=on:nm=4:nwc=1:stl=30:sd=3:ss=axioms:st=1.5:sos=on:thsq=on_1 on theBenchmark 0.21/0.45 % (6522)ott+11_20_afr=on:afp=100000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=sco:anc=all:bsr=on:irw=on:lma=on:nm=4:nwc=1.2:sac=on:sp=occurrence:thsq=on_6 on theBenchmark 0.21/0.46 % (6527)dis+10_4_av=off:bsr=on:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:cond=fast:er=filter:fde=none:gsp=input_only:lcm=reverse:lma=on:nwc=4:sp=occurrence:urr=on:thsq=on_8 on theBenchmark 0.21/0.46 % (6520)lrs+1010_3:2_afr=on:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=100000:afq=1.1:anc=none:gsp=input_only:irw=on:lwlo=on:nm=2:newcnf=on:nwc=1.7:sac=on:sp=occurrence:thsq=on_300 on theBenchmark 0.21/0.46 % (6514)dis+10_128_acc=on:add=off:add=off:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on:thsq=on_40 on theBenchmark 0.21/0.47 % (6513)dis+1_2:3_acc=on:add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=40000:afq=2.0:amm=sco:anc=none:er=filter:fsr=off:gsp=input_only:gs=on:gsem=off:nm=64:newcnf=on:nwc=1:thsq=on_3 on theBenchmark 0.21/0.48 % (6529)lrs+1011_5_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=1000:afq=1.2:anc=none:fsr=off:irw=on:lma=on:nm=64:newcnf=on:nwc=1:stl=30:sd=3:ss=axioms:st=2.0:sos=on:sac=on:sp=reverse_arity:urr=on:updr=off:thsq=on_130 on theBenchmark 5.85/1.19 % (6510)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 6.66/1.27 % (6508)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 6.66/1.30 % (6511)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 6.66/1.30 % (6520)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 6.66/1.31 % (6513)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 6.66/1.34 % (6521)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 7.80/1.35 % (6517)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 7.83/1.37 % (6530)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 8.23/1.42 % (6506)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs. 8.60/1.45 % (6528)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 8.60/1.45 % (6529)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs. 10.62/1.72 % (6510)Time limit reached! 10.62/1.72 % (6510)------------------------------ 10.62/1.72 % (6510)Version: Vampire 4.6.0 (commit 0afb7ed4a on 2021-06-23 15:27:21 +0100) 10.62/1.72 % (6510)Termination reason: Time limit 10.62/1.72 10.62/1.72 % (6510)Memory used [KB]: 16758 10.62/1.72 % (6510)Time elapsed: 1.347 s 10.62/1.72 % (6510)------------------------------ 10.62/1.72 % (6510)------------------------------ 10.62/1.73 % (6518)Time limit reached! 10.62/1.73 % (6518)------------------------------ 10.62/1.73 % (6518)Version: Vampire 4.6.0 (commit 0afb7ed4a on 2021-06-23 15:27:21 +0100) 10.62/1.73 % (6518)Termination reason: Time limit 10.62/1.73 % (6518)Termination phase: Saturation 10.62/1.73 10.62/1.73 % (6518)Memory used [KB]: 10362 10.62/1.73 % (6518)Time elapsed: 0.500 s 10.62/1.73 % (6518)------------------------------ 10.62/1.73 % (6518)------------------------------ 10.62/1.74 % (6512)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs. 10.95/1.77 % (6527)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs. 10.95/1.77 % (6738)dis+1010_3:2_av=off:csup=on:prag=on:chr=on:cases=on:bet=on:cnfonf=lazy_not_be_gen:gsp=input_only:nm=2:nwc=1:sp=reverse_arity:urr=ec_only:thsq=on_29 on theBenchmark 10.95/1.77 % (6737)dis+1011_10_add=large:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afr=on:afp=4000:afq=1.0:amm=off:anc=none:lma=on:nm=64:nwc=4:sac=on:sp=occurrence:thsq=on_75 on theBenchmark 10.95/1.87 % (6523)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs. 10.95/1.92 % (6527)First to succeed. 11.86/1.95 % (6527)Refutation found. Thanks to Tanya! 11.86/1.95 % SZS status Theorem for theBenchmark 11.86/1.95 % SZS output start Proof for theBenchmark 11.86/1.95 thf(type_def_6, type, >: ($tType * $tType) > $tType). 11.86/1.95 thf(func_def_7, type, c_Eps_i: ($i > $o) > $i). 11.86/1.95 thf(func_def_10, type, c_not: $o > $o). 11.86/1.95 thf(func_def_11, type, c_and: $o > $o > $o). 11.86/1.95 thf(func_def_12, type, c_or: $o > $o > $o). 11.86/1.95 thf(func_def_13, type, c_iff: $o > $o > $o). 11.86/1.95 thf(func_def_14, type, c_In: $i > $i > $o). 11.86/1.95 thf(func_def_15, type, c_Subq: $i > $i > $o). 11.86/1.95 thf(func_def_17, type, c_Union: $i > $i). 11.86/1.95 thf(func_def_18, type, c_Power: $i > $i). 11.86/1.95 thf(func_def_19, type, c_Repl: $i > ($i > $i) > $i). 11.86/1.95 thf(func_def_20, type, c_TransSet: $i > $o). 11.86/1.95 thf(func_def_21, type, c_atleast2: $i > $o). 11.86/1.95 thf(func_def_22, type, c_atleast3: $i > $o). 11.86/1.95 thf(func_def_23, type, c_atleast4: $i > $o). 11.86/1.95 thf(func_def_24, type, c_atleast5: $i > $o). 11.86/1.95 thf(func_def_25, type, c_atleast6: $i > $o). 11.86/1.95 thf(func_def_26, type, c_exactly2: $i > $o). 11.86/1.95 thf(func_def_27, type, c_exactly3: $i > $o). 11.86/1.95 thf(func_def_28, type, c_exactly4: $i > $o). 11.86/1.95 thf(func_def_29, type, c_exactly5: $i > $o). 11.86/1.95 thf(func_def_30, type, c_exu_i: ($i > $o) > $o). 11.86/1.95 thf(func_def_31, type, c_reflexive_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_32, type, c_irreflexive_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_33, type, c_symmetric_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_34, type, c_antisymmetric_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_35, type, c_transitive_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_36, type, c_eqreln_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_37, type, c_per_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_38, type, c_linear_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_39, type, c_trichotomous_or_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_40, type, c_partialorder_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_41, type, c_totalorder_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_42, type, c_strictpartialorder_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_43, type, c_stricttotalorder_i: ($i > $i > $o) > $o). 11.86/1.95 thf(func_def_44, type, c_If_i: $o > $i > $i > $i). 11.86/1.95 thf(func_def_45, type, c_exactly1of2: $o > $o > $o). 11.86/1.95 thf(func_def_46, type, c_exactly1of3: $o > $o > $o > $o). 11.86/1.95 thf(func_def_47, type, c_nIn: $i > $i > $o). 11.86/1.95 thf(func_def_48, type, c_nSubq: $i > $i > $o). 11.86/1.95 thf(func_def_49, type, c_UPair: $i > $i > $i). 11.86/1.95 thf(func_def_50, type, c_Sing: $i > $i). 11.86/1.95 thf(func_def_51, type, c_binunion: $i > $i > $i). 11.86/1.95 thf(func_def_52, type, c_SetAdjoin: $i > $i > $i). 11.86/1.95 thf(func_def_53, type, c_famunion: $i > ($i > $i) > $i). 11.86/1.95 thf(func_def_54, type, c_Sep: $i > ($i > $o) > $i). 11.86/1.95 thf(func_def_55, type, c_ReplSep: $i > ($i > $o) > ($i > $i) > $i). 11.86/1.95 thf(func_def_56, type, c_binintersect: $i > $i > $i). 11.86/1.95 thf(func_def_57, type, c_setminus: $i > $i > $i). 11.86/1.95 thf(func_def_58, type, c_inj: $i > $i > ($i > $i) > $o). 11.86/1.95 thf(func_def_59, type, c_bij: $i > $i > ($i > $i) > $o). 11.86/1.95 thf(func_def_60, type, c_atleastp: $i > $i > $o). 11.86/1.95 thf(func_def_61, type, c_equip: $i > $i > $o). 11.86/1.95 thf(func_def_62, type, c_In_rec_poly_G_i: ($i > ($i > $i) > $i) > $i > $i > $o). 11.86/1.95 thf(func_def_63, type, c_In_rec_poly_i: ($i > ($i > $i) > $i) > $i > $i). 11.86/1.95 thf(func_def_64, type, c_ordsucc: $i > $i). 11.86/1.95 thf(func_def_65, type, c_nat_p: $i > $o). 11.86/1.95 thf(func_def_66, type, c_nat_primrec: $i > ($i > $i > $i) > $i > $i). 11.86/1.95 thf(func_def_67, type, c_add_nat: $i > $i > $i). 11.86/1.95 thf(func_def_68, type, c_mul_nat: $i > $i > $i). 11.86/1.95 thf(func_def_69, type, c_ordinal: $i > $o). 11.86/1.95 thf(func_def_70, type, c_V_: $i > $i). 11.86/1.95 thf(func_def_71, type, c_Inj1: $i > $i). 11.86/1.95 thf(func_def_72, type, c_Inj0: $i > $i). 11.86/1.95 thf(func_def_73, type, c_Unj: $i > $i). 11.86/1.95 thf(func_def_74, type, c_combine_funcs: $i > $i > ($i > $i) > ($i > $i) > $i > $i). 11.86/1.95 thf(func_def_75, type, c_setsum: $i > $i > $i). 11.86/1.95 thf(func_def_76, type, c_proj0: $i > $i). 11.86/1.95 thf(func_def_77, type, c_proj1: $i > $i). 11.86/1.95 thf(func_def_78, type, c_binrep: $i > $i > $i). 11.86/1.95 thf(func_def_79, type, c_lam: $i > ($i > $i) > $i). 11.86/1.95 thf(func_def_80, type, c_setprod: $i > $i > $i). 11.86/1.95 thf(func_def_81, type, c_ap: $i > $i > $i). 11.86/1.95 thf(func_def_82, type, c_setsum_p: $i > $o). 11.86/1.95 thf(func_def_83, type, c_tuple_p: $i > $i > $o). 11.86/1.95 thf(func_def_84, type, c_Pi: $i > ($i > $i) > $i). 11.86/1.95 thf(func_def_85, type, c_setexp: $i > $i > $i). 11.86/1.95 thf(func_def_86, type, c_Sep2: $i > ($i > $i) > ($i > $i > $o) > $i). 11.86/1.95 thf(func_def_87, type, c_set_of_pairs: $i > $o). 11.86/1.95 thf(func_def_88, type, c_lam2: $i > ($i > $i) > ($i > $i > $i) > $i). 11.86/1.95 thf(func_def_89, type, c_PNoEq_: $i > ($i > $o) > ($i > $o) > $o). 11.86/1.95 thf(func_def_90, type, c_PNoLt_: $i > ($i > $o) > ($i > $o) > $o). 11.86/1.95 thf(func_def_91, type, c_PNoLt: $i > ($i > $o) > $i > ($i > $o) > $o). 11.86/1.95 thf(func_def_92, type, c_PNoLe: $i > ($i > $o) > $i > ($i > $o) > $o). 11.86/1.95 thf(func_def_93, type, c_PNo_downc: ($i > ($i > $o) > $o) > $i > ($i > $o) > $o). 11.86/1.95 thf(func_def_94, type, c_PNo_upc: ($i > ($i > $o) > $o) > $i > ($i > $o) > $o). 11.86/1.95 thf(func_def_95, type, c_SNoElts_: $i > $i). 11.86/1.95 thf(func_def_96, type, c_SNo_: $i > $i > $o). 11.86/1.95 thf(func_def_97, type, c_PSNo: $i > ($i > $o) > $i). 11.86/1.95 thf(func_def_98, type, c_SNo: $i > $o). 11.86/1.95 thf(func_def_99, type, c_SNoLev: $i > $i). 11.86/1.95 thf(func_def_100, type, c_SNoEq_: $i > $i > $i > $o). 11.86/1.95 thf(func_def_101, type, c_SNoLt: $i > $i > $o). 11.86/1.95 thf(func_def_102, type, c_SNoLe: $i > $i > $o). 11.86/1.95 thf(func_def_103, type, c_binop_on: $i > ($i > $i > $i) > $o). 11.86/1.95 thf(func_def_104, type, c_Loop: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > $o). 11.86/1.95 thf(func_def_105, type, c_Loop_with_defs: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $o). 11.86/1.95 thf(func_def_106, type, c_Loop_with_defs_cex1: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $o). 11.86/1.95 thf(func_def_107, type, c_Loop_with_defs_cex2: $i > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $i > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > ($i > $i > $i) > $o). 11.86/1.95 thf(func_def_108, type, c_combinator: $i > $o). 11.86/1.95 thf(func_def_109, type, c_combinator_equiv: $i > $i > $o). 11.86/1.95 thf(func_def_110, type, c_equip_mod: $i > $i > $i > $o). 11.86/1.95 thf(func_def_112, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)). 11.86/1.95 thf(func_def_115, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)). 11.86/1.95 thf(func_def_116, type, cCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > X1 > X0 > X2)). 11.86/1.95 thf(func_def_117, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)). 11.86/1.95 thf(func_def_118, type, sCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > (X0 > X1) > X0 > X2)). 11.86/1.95 thf(func_def_119, type, iCOMB: !>[X0: $tType]:(X0 > X0)). 11.86/1.95 thf(func_def_120, type, vIMP: $o > $o > $o). 11.86/1.95 thf(func_def_121, type, vSIGMA: !>[X0: $tType]:((X0 > $o) > $o)). 11.86/1.95 thf(func_def_122, type, vPI: !>[X0: $tType]:((X0 > $o) > $o)). 11.86/1.95 thf(func_def_123, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)). 11.86/1.95 thf(func_def_124, type, sP0: ($i > $o) > $o). 11.86/1.95 thf(func_def_125, type, sP1: ($i > $o) > $o). 11.86/1.95 thf(func_def_129, type, sK5: $i > $i). 11.86/1.95 thf(func_def_130, type, sK6: ($i > $o) > $i). 11.86/1.95 thf(func_def_131, type, sK7: ($i > $o) > $i). 11.86/1.95 thf(func_def_132, type, sK8: ($i > $o) > $i > $i). 11.86/1.95 thf(func_def_133, type, sK9: ($i > $o) > $i). 11.86/1.95 thf(func_def_134, type, sK10: ($i > $o) > $i). 11.86/1.95 thf(func_def_135, type, sK11: ($i > $o) > $i). 11.86/1.95 thf(func_def_136, type, sK12: ($i > $o) > $i). 11.86/1.95 thf(func_def_137, type, vAND: $o > $o > $o). 11.86/1.95 thf(func_def_138, type, vOR: $o > $o > $o). 11.86/1.95 thf(func_def_139, type, vNOT: $o > $o). 11.86/1.95 thf(f1169,plain,( 11.86/1.95 $false), 11.86/1.95 inference(trivial_inequality_removal,[],[f1164])). 11.86/1.95 thf(f1164,plain,( 11.86/1.95 ($true = $false)), 11.86/1.95 inference(backward_demodulation,[],[f323,f1159])). 11.86/1.95 thf(f1159,plain,( 11.86/1.95 ( ! [X1 : $i] : (($false = ((c_In @ X1) @ c_Empty))) )), 11.86/1.95 inference(trivial_inequality_removal,[],[f1158])). 11.86/1.95 thf(f1158,plain,( 11.86/1.95 ( ! [X1 : $i] : (($true = $false) | ($false = ((c_In @ X1) @ c_Empty))) )), 11.86/1.95 inference(forward_demodulation,[],[f1157,f656])). 11.86/1.95 thf(f656,plain,( 11.86/1.95 ($false = (c_not @ $true))), 11.86/1.95 inference(unit_resulting_resolution,[],[f111,f651])). 11.86/1.95 thf(f651,plain,( 11.86/1.95 ( ! [X1 : $o] : (((c_not @ X1) = $false) | ($false = X1)) )), 11.86/1.95 inference(not_proxy_clausification,[],[f650])). 11.86/1.95 thf(f650,plain,( 11.86/1.95 ( ! [X1 : $o] : (((c_not @ X1) = $false) | ($true = (vNOT @ X1))) )), 11.86/1.95 inference(binary_proxy_clausification,[],[f648])). 11.86/1.95 thf(f648,plain,( 11.86/1.95 ( ! [X1 : $o] : (((c_not @ X1) = (vNOT @ X1))) )), 11.86/1.95 inference(boolean_simplification,[],[f647])). 11.86/1.95 thf(f647,plain,( 11.86/1.95 ( ! [X1 : $o] : (((c_not @ X1) = ((vIMP @ X1) @ $false))) )), 11.86/1.95 inference(combinator_demodulation,[],[f646])). 11.86/1.95 thf(f646,plain,( 11.86/1.95 ( ! [X1 : $o] : (((c_not @ X1) = (((cCOMB @ vIMP) @ $false) @ X1))) )), 11.86/1.95 inference(argument_congruence,[],[f640])). 11.86/1.95 thf(f640,plain,( 11.86/1.95 (c_not = ((cCOMB @ vIMP) @ $false))), 11.86/1.95 inference(forward_demodulation,[],[f425,f500])). 11.86/1.95 thf(f500,plain,( 11.86/1.95 (c_False = $false)), 11.86/1.95 inference(unit_resulting_resolution,[],[f331,f459])). 11.86/1.95 thf(f459,plain,( 11.86/1.95 ( ! [X1 : $o] : ((c_False = $false) | ($true = X1)) )), 11.86/1.95 inference(combinator_demodulation,[],[f458])). 11.86/1.95 thf(f458,plain,( 11.86/1.95 ( ! [X1 : $o] : ((c_False = $false) | ($true = (iCOMB @ X1))) )), 11.86/1.95 inference(pi_clausification,[],[f457])). 11.86/1.95 thf(f457,plain,( 11.86/1.95 (c_False = $false) | ($true = (vPI($o) @ iCOMB))), 11.86/1.95 inference(binary_proxy_clausification,[],[f378])). 11.86/1.95 thf(f378,plain,( 11.86/1.95 (c_False = (vPI($o) @ iCOMB))), 11.86/1.95 inference(cnf_transformation,[],[f189])). 11.86/1.95 thf(f189,plain,( 11.86/1.95 (c_False = (vPI($o) @ iCOMB))), 11.86/1.95 inference(fool_elimination,[],[f188])). 11.86/1.95 thf(f188,plain,( 11.86/1.95 (c_False = ! [X0 : $o] : X0)), 11.86/1.95 inference(rectify,[],[f26])). 11.86/1.95 thf(f26,axiom,( 11.86/1.95 (c_False = ! [X0 : $o] : X0)), 11.86/1.95 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax11)). 11.86/1.95 thf(f331,plain,( 11.86/1.95 ( ! [X3 : $i] : (((c_nat_p @ X3) != $true)) )), 11.86/1.95 inference(cnf_transformation,[],[f306])). 11.86/1.95 thf(f306,plain,( 11.86/1.95 ((! [X3] : (((c_nat_p @ X3) != $true) & (($true = ((c_and @ (c_atleast5 @ sK4)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ sK4) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ (sK5 @ X3)))))) | (((c_atleast3 @ X3) != $true) & (((sK5 @ X3) = X3) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & (($true = ((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ (sK5 @ X3))))) | ((c_ordinal @ X3) != $true))) & ($true = ((c_In @ sK4) @ sK3))) & ($true = ((c_In @ sK3) @ sK2))) & ($true = ((c_In @ sK2) @ c_Empty))), 11.86/1.95 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f290,f305,f304,f303,f302])). 11.86/1.95 thf(f302,plain,( 11.86/1.95 ? [X0] : (? [X1] : (? [X2] : (! [X3] : ? [X4] : (((c_nat_p @ X3) != $true) & ((((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & (((c_In @ X2) @ X1) = $true)) & (((c_In @ X1) @ X0) = $true)) & (((c_In @ X0) @ c_Empty) = $true)) => (? [X1] : (? [X2] : (! [X3] : ? [X4] : (((c_nat_p @ X3) != $true) & ((((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & (((c_In @ X2) @ X1) = $true)) & ($true = ((c_In @ X1) @ sK2))) & ($true = ((c_In @ sK2) @ c_Empty)))), 11.86/1.95 introduced(choice_axiom,[])). 11.86/1.95 thf(f303,plain,( 11.86/1.95 ? [X1] : (? [X2] : (! [X3] : ? [X4] : (((c_nat_p @ X3) != $true) & ((((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & (((c_In @ X2) @ X1) = $true)) & ($true = ((c_In @ X1) @ sK2))) => (? [X2] : (! [X3] : ? [X4] : (((c_nat_p @ X3) != $true) & ((((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & ($true = ((c_In @ X2) @ sK3))) & ($true = ((c_In @ sK3) @ sK2)))), 11.86/1.95 introduced(choice_axiom,[])). 11.86/1.95 thf(f304,plain,( 11.86/1.95 ? [X2] : (! [X3] : ? [X4] : (((c_nat_p @ X3) != $true) & ((((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & ($true = ((c_In @ X2) @ sK3))) => (! [X3] : ? [X4] : (((c_nat_p @ X3) != $true) & (($true = ((c_and @ (c_atleast5 @ sK4)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ sK4) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4))))) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & ($true = ((c_In @ sK4) @ sK3)))), 11.86/1.95 introduced(choice_axiom,[])). 11.86/1.95 thf(f305,plain,( 11.86/1.95 ! [X3] : (? [X4] : (((c_nat_p @ X3) != $true) & (($true = ((c_and @ (c_atleast5 @ sK4)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ sK4) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4))))) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) => (((c_nat_p @ X3) != $true) & (($true = ((c_and @ (c_atleast5 @ sK4)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ sK4) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ (sK5 @ X3)))))) | (((c_atleast3 @ X3) != $true) & (((sK5 @ X3) = X3) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & (($true = ((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ (sK5 @ X3))))) | ((c_ordinal @ X3) != $true))))), 11.86/1.95 introduced(choice_axiom,[])). 11.86/1.95 thf(f290,plain,( 11.86/1.95 ? [X0] : (? [X1] : (? [X2] : (! [X3] : ? [X4] : (((c_nat_p @ X3) != $true) & ((((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true))) | ((c_atleast2 @ X3) != $true) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & (((c_In @ X2) @ X1) = $true)) & (((c_In @ X1) @ X0) = $true)) & (((c_In @ X0) @ c_Empty) = $true))), 11.86/1.95 inference(flattening,[],[f289])). 11.86/1.95 thf(f289,plain,( 11.86/1.95 ? [X0] : (? [X1] : (? [X2] : (! [X3] : ? [X4] : ((((c_nat_p @ X3) != $true) & ((((((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true) | (((c_atleast3 @ X3) != $true) & ((X3 = X4) | ((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) != $true)))) | ((c_atleast2 @ X3) != $true)) | (((c_exactly2 @ X3) != $true) & ((c_ordinal @ X3) = $true)))) & ((((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true) | ((c_ordinal @ X3) != $true))) & (((c_In @ X2) @ X1) = $true)) & (((c_In @ X1) @ X0) = $true)) & (((c_In @ X0) @ c_Empty) = $true))), 11.86/1.95 inference(ennf_transformation,[],[f113])). 11.86/1.95 thf(f113,plain,( 11.86/1.95 ~! [X0] : ((((c_In @ X0) @ c_Empty) = $true) => ! [X1] : ((((c_In @ X1) @ X0) = $true) => ! [X2] : ((((c_In @ X2) @ X1) = $true) => ? [X3] : ! [X4] : ((((c_ordinal @ X3) = $true) => (((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4))) = $true)) => (((((c_ordinal @ X3) = $true) => ((c_exactly2 @ X3) = $true)) => (((c_atleast2 @ X3) = $true) => (((((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) = $true) => (X3 = X4)) => ((c_atleast3 @ X3) = $true)) => (((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4)))) = $true)))) => ((c_nat_p @ X3) = $true))))))), 11.86/1.95 inference(fool_elimination,[],[f112])). 11.86/1.95 thf(f112,plain,( 11.86/1.95 ~! [X0] : (((c_In @ X0) @ c_Empty) => ! [X1] : (((c_In @ X1) @ X0) => ! [X2] : (((c_In @ X2) @ X1) => ? [X3] : ! [X4] : (((c_ordinal @ X3) => ((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4)))) => ((((c_ordinal @ X3) => (c_exactly2 @ X3)) => ((c_atleast2 @ X3) => ((((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) => (X3 = X4)) => (c_atleast3 @ X3)) => ((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4))))))) => (c_nat_p @ X3))))))), 11.86/1.95 inference(rectify,[],[f74])). 11.86/1.95 thf(f74,negated_conjecture,( 11.86/1.95 ~! [X0] : (((c_In @ X0) @ c_Empty) => ! [X1] : (((c_In @ X1) @ X0) => ! [X2] : (((c_In @ X2) @ X1) => ? [X3] : ! [X4] : (((c_ordinal @ X3) => ((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4)))) => ((((c_ordinal @ X3) => (c_exactly2 @ X3)) => ((c_atleast2 @ X3) => ((((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) => (X3 = X4)) => (c_atleast3 @ X3)) => ((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4))))))) => (c_nat_p @ X3))))))), 11.86/1.95 inference(negated_conjecture,[],[f73])). 11.86/1.95 thf(f73,conjecture,( 11.86/1.95 ! [X0] : (((c_In @ X0) @ c_Empty) => ! [X1] : (((c_In @ X1) @ X0) => ! [X2] : (((c_In @ X2) @ X1) => ? [X3] : ! [X4] : (((c_ordinal @ X3) => ((c_and @ (c_exactly2 @ X3)) @ (c_not @ (c_exactly5 @ X4)))) => ((((c_ordinal @ X3) => (c_exactly2 @ X3)) => ((c_atleast2 @ X3) => ((((c_not @ (c_atleast2 @ (c_Power @ ((c_binrep @ (c_Power @ (c_Power @ c_Empty))) @ c_Empty)))) => (X3 = X4)) => (c_atleast3 @ X3)) => ((c_and @ (c_atleast5 @ X2)) @ (c_not @ ((c_exactly1of2 @ ((c_SNoLt @ X2) @ ((c_binrep @ (c_Power @ (c_Power @ (c_Power @ (c_Power @ c_Empty))))) @ c_Empty))) @ (c_TransSet @ X4))))))) => (c_nat_p @ X3))))))), 11.86/1.95 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj)). 11.86/1.95 thf(f425,plain,( 11.86/1.95 (c_not = ((cCOMB @ vIMP) @ c_False))), 11.86/1.95 inference(cnf_transformation,[],[f260])). 11.86/1.95 thf(f260,plain,( 11.86/1.95 (c_not = ((cCOMB @ vIMP) @ c_False))), 11.86/1.95 inference(fool_elimination,[],[f259])). 11.86/1.95 thf(f259,plain,( 11.86/1.95 (c_not = (^[X0 : $o] : (X0 => c_False)))), 11.86/1.95 inference(rectify,[],[f58])). 11.86/1.95 thf(f58,axiom,( 11.86/1.95 (c_not = (^[X0 : $o] : (X0 => c_False)))), 11.86/1.95 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax13)). 11.86/1.95 thf(f111,plain,( 11.86/1.95 ($true != $false)), 11.86/1.95 introduced(fool_axiom,[])). 11.86/1.95 thf(f1157,plain,( 11.86/1.95 ( ! [X1 : $i] : (($true = (c_not @ $true)) | ($false = ((c_In @ X1) @ c_Empty))) )), 11.86/1.95 inference(combinator_demodulation,[],[f1156])). 11.86/1.95 thf(f1156,plain,( 11.86/1.95 ( ! [X1 : $i] : (($true = (c_not @ $true)) | ($false = (((cCOMB @ c_In) @ c_Empty) @ X1))) )), 11.86/1.95 inference(pi_clausification,[],[f1102])). 11.86/1.95 thf(f1102,plain,( 11.86/1.95 ($true = (c_not @ $true)) | ($false = (vSIGMA($i) @ ((cCOMB @ c_In) @ c_Empty)))), 11.86/1.95 inference(fool_paramodulation,[],[f449])). 11.86/1.95 thf(f449,plain,( 11.86/1.95 ($true = (c_not @ (vSIGMA($i) @ ((cCOMB @ c_In) @ c_Empty))))), 11.86/1.95 inference(cnf_transformation,[],[f287])). 11.86/1.95 thf(f287,plain,( 11.86/1.95 ($true = (c_not @ (vSIGMA($i) @ ((cCOMB @ c_In) @ c_Empty))))), 11.86/1.95 inference(fool_elimination,[],[f286])). 11.86/1.95 thf(f286,plain,( 11.86/1.95 (c_not @ ? [X0] : ((c_In @ X0) @ c_Empty))), 11.86/1.95 inference(rectify,[],[f21])). 11.86/1.95 thf(f21,axiom,( 11.86/1.95 (c_not @ ? [X0] : ((c_In @ X0) @ c_Empty))), 11.86/1.95 file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5)). 11.86/1.95 thf(f323,plain,( 11.86/1.95 ($true = ((c_In @ sK2) @ c_Empty))), 11.86/1.95 inference(cnf_transformation,[],[f306])). 11.86/1.95 % SZS output end Proof for theBenchmark 11.86/1.95 % (6527)------------------------------ 11.86/1.95 % (6527)Version: Vampire 4.6.0 (commit 0afb7ed4a on 2021-06-23 15:27:21 +0100) 11.86/1.95 % (6527)Termination reason: Refutation 11.86/1.95 11.86/1.95 % (6527)Memory used [KB]: 3709 11.86/1.95 % (6527)Time elapsed: 1.538 s 11.86/1.95 % (6527)------------------------------ 11.86/1.95 % (6527)------------------------------ 11.86/1.95 % (6492)Success in time 1.592 s 11.86/1.95 EOF